Benchmarking discrete optimization heuristics with IOHprofiler
نویسندگان
چکیده
منابع مشابه
Complexity Theory for Discrete Black-Box Optimization Heuristics
A predominant topic in the theory of evolutionary algorithms and, more generally, theory of randomized black-box optimization techniques is running time analysis. Running time analysis aims at understanding the performance of a given heuristic on a given problem by bounding the number of function evaluations that are needed by the heuristic to identify a solution of a desired quality. As in gen...
متن کاملGlobal Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation
The well-known and established global optimality conditions based on the Lagrangian formulation of an optimization problem are consistent if and only if the duality gap is zero. We develop a set of global optimality conditions which are structurally similar but which are consistent for any size of the duality gap. This system characterizes a primal–dual optimal solution by means of primal and d...
متن کاملLocal search heuristics for discrete structural optimization with expensive black-box evaluations
This paper considers structural optimization problems featuring discrete variables, as well as nonlinear implicit constraints which can only be evaluated through time-expensive computations. A prominent application consists in the preliminary structural design of large ships, where many of the variables take their values in discrete sets which model standard element dimensions to be selected fr...
متن کاملBenchmarking Optimization Software with Performance Profiles
We propose performance profiles — distribution functions for a performance metric — as a tool for benchmarking and comparing optimization software. We show that performance profiles combine the best features of other tools for performance evaluation.
متن کاملCost-Based Query Optimization with Heuristics
In today’s computational world,cost of computation is the most significant factor for any database management system.Searching a query from a database incurs various computational costs like processor time and communication time.Then, there are costs because of operations like projection, selection, join etc.DBMS strives to process the query in the most efficient way (in terms of ‘Time’) to pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2020
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2019.106027